Comparative analysis of routing techniques in chord overlay network

نویسندگان

چکیده

Overlay networks are not a new field or area of study. This domain computing will someday drive P2P systems in various application areas such as block-chain, energy trading, video multicasting, and distributed file storage. study highlights the two widely known methods routing information employed one overlay called chord. In this study, simulations both modes (iterative recursive) their variations under no-churn (leaving joining nodes) churn conditions was carried out. The parameter (successor list size) varied for each techniques simulation results obtained show that semi recursive gives better performance scenarios.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

analysis of power in the network society

اندیشمندان و صاحب نظران علوم اجتماعی بر این باورند که مرحله تازه ای در تاریخ جوامع بشری اغاز شده است. ویژگیهای این جامعه نو را می توان پدیده هایی از جمله اقتصاد اطلاعاتی جهانی ، هندسه متغیر شبکه ای، فرهنگ مجاز واقعی ، توسعه حیرت انگیز فناوری های دیجیتال، خدمات پیوسته و نیز فشردگی زمان و مکان برشمرد. از سوی دیگر قدرت به عنوان موضوع اصلی علم سیاست جایگاه مهمی در روابط انسانی دارد، قدرت و بازتولید...

15 صفحه اول

Chord: Structured Overlay Network for Non-Uniform Load-Distribution

Data lookup is a fundamental problem in peer-to-peer systems: Given a key, find the node that stores the associated object. Chord and other P2P algorithms use distributed hash tables (DHTs) to distribute the keys and nodes evenly across a logical ring. Using an efficient routing strategy, DHTs provide a routing performance of O(logN) in networks of N nodes. While the routing performance has bee...

متن کامل

C2: A New Overlay Network Based on CAN and Chord

In this paper, we present C, a new overlay network based on CAN and Chord. For an n-peer C system, each peer maintains only about O(log n) other peers’ information, and achieves routing within O(log n) hops. For each peer’s join or departure, C can update the routing table within O(log n) messages with high probability. What distinguish C from many other peer-to-peer data-sharing systems are it...

متن کامل

Performance Analysis of Chord Protocol for Peer to Peer Overlay Topology in Wireless Mesh Network

Peer-to-Peer (P2P) applications have been extensively used for file sharing and accounts for more than 70% of the traffic in the internet. The inherent characteristics of P2P make it advantageous in content distribution when compared to client-server architecture. In a P2P network, there is no clear distinction between client and server nodes, as every peer is both a client and a server at the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Power Electronics and Drive Systems

سال: 2021

ISSN: ['2722-2578', '2722-256X']

DOI: https://doi.org/10.11591/ijece.v11i5.pp4361-4372